On certain unimodal sequences and strict partitions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks on Strict Partitions

We consider a certain sequence of random walks. The state space of the nth random walk is the set of all strict partitions of n (that is, partitions without equal parts). We prove that, as n goes to infinity, these random walks converge to a continuous-time Markov process. The state space of this process is the infinite-dimensional simplex consisting of all nonincreasing infinite sequences of n...

متن کامل

A bijection between certain non-crossing partitions and sequences

We present a bijection between non-crossing partitions of the set [2n+1] into n+1 blocks such that no block contains two consecutive integers, and the set of sequences {si}n1 such that 1 ≤ si ≤ i, and if si = j, then si−r ≤ j − r for 1 ≤ r ≤ j − 1.

متن کامل

On Certain Monomial Sequences

We give equivalent conditions for a monomial sequence to be a dsequence or a proper sequence, and a sufficient condition for a monomial sequence to be an s-sequence in order to compute invariants of the symmetric algebra of the ideal generated by it.

متن کامل

On generalized Tribonacci sequences and additive partitions

In this paper we give a partial description of the generalized Tribonacci sequences for which there exists a partition of the positive integers into two sets such that no two distinct elements of the same set sum to an element of the sequence. Prior work in this eld considered only the special case of the Tribonacci sequence.

متن کامل

Strict Partitions of Maximal Projective Degree

The projective degrees of strict partitions of n were computed for all n ≤ 100 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n “lie close to each other” in a certain sense. Conjecturing that this holds for larger values of n, the partitions of maximal degree were computed for all n ≤ 220. The results ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2020

ISSN: 0012-365X

DOI: 10.1016/j.disc.2019.111650